Sorting Almost Ordered Arrays

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Sorting on Circular Arrays

We analyze the sorting problem on circular processor arrays with bidirectional connections. We assume that initially each PU holds k 1 packets. On linear processor arrays the sorting problem can easily be solved for any k by using odd-even transposition sort, but for the circular array it is not obvious how to exploit the wrap-around connection. The easier routing problem on circular processor ...

متن کامل

Decoding randomly ordered DNA arrays.

We have developed a simple and efficient algorithm to identify each member of a large collection of DNA-linked objects through the use of hybridization, and have applied it to the manufacture of randomly assembled arrays of beads in wells. Once the algorithm has been used to determine the identity of each bead, the microarray can be used in a wide variety of applications, including single nucle...

متن کامل

On the Group of Almost-Riordan Arrays

We study a super group of the group of Riordan arrays, where the elements of the group are given by a triple of power series. We show that certain subsets are subgroups, and we identify a normal subgroup whose cosets correspond to Riordan arrays. We give an example of an almost-Riordan array that has been studied in the context of Hankel and Hankel plus Toepliz matrices, and we show that suitab...

متن کامل

Optimal Average Case Sorting on Arrays

We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were...

متن کامل

Integrated VCSEL Arrays for Optofluidic Sorting

We present the concept of an ultra-small, potentially low-cost microfluidic sorting unit based on vertical-cavity surface-emitting lasers. The densely packed lasers are integrated with the microfluidic channel and form an optical lattice. We show first results in an experimental setup, followed by tests of the first generation of integrated setups. A promising novel integration approach and fut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1968

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/11.2.134